Application of Wu’s Method to Proving Total Correctness of Recursive Program
نویسندگان
چکیده
منابع مشابه
Proving the Correctness of Program Transformations
Given a formal specification S of a problem, we wish to obtain a computer program that solves this problem. The traditional approach used to obtain such a program has been to give the formal specification to a programmer. The programmer’s task is to study the specification, and after he fully understands it, to write a computer program satisfying the specification. For critical applications, fo...
متن کاملResolution Methods in Proving the Program Correctness
Program testing determines whether its behavior matches the specification, and also how it behaves in different exploitation conditions. Proving of program correctness is reduced to finding a proof for assertion that given sequence of formulas represents derivation within a formal theory of special predicted calculus. A well-known variant of this conception is described: correctness based on pr...
متن کاملProving the Correctness of Recursion-Based Automatic Program Transformations
This paper shows how the Improvement Theorem|a semantic condition for the total correctness of program transformation on higher-order functional programs|has practical value in proving the correctness of automatic techniques, including deforestation and supercompilation. This is aided by a novel formulation (and generalisation) of deforestation-like transformations, which also greatly adds to t...
متن کاملProving the Correctness of Unfold/Fold Program Transformations Using Bisimulation
This paper shows that a bisimulation approach can be used to prove the correctness of unfold/fold program transformation algorithms. As an illustration, we show how our approach can be use to prove the correctness of positive supercompilation (due to Sørensen et al). Traditional program equivalence proofs show the original and transformed programs are contextually equivalent, i.e., have the sam...
متن کاملProving the Correctness of Recursion-based Automatic Program Transformations 1
This paper shows how the Improvement Theorem|a semantic condition for establishing the total correctness of program transformation on higher-order functional programs|has practical value in proving the correctness of automatic techniques. To this end we develop and study a family of automatic program transformations. The root of this family is a well-known and widely studied transformation call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2010
ISSN: 1812-5638
DOI: 10.3923/itj.2010.1431.1439